package org.chnxi.datastructures.tree;

/**
 * 顺序存储二叉树
 */
public class ArrayBinaryTreeDemo {

    public static void main(String[] args) {
        int[] arr = {1,2,3,4,5,6,7};
        ArrayBinaryTree abt = new ArrayBinaryTree(arr);
        System.out.println("测试前序打印：");
        abt.printPreOrder(0);
        System.out.println("测试中序打印：");
        abt.printInfixOrder(0);
        System.out.println("测试后序打印：");
        abt.printPostOrder(0);
    }

}



